Completeness of context-free grammar forms
نویسندگان
چکیده
منابع مشابه
Completeness of Context-Free Grammar Forms
The notions of a grammar form and g-interpretation were first introduced in [2]. However, it quickly became apparent, particularly for EOL forms [5], that (strict) interpretations had a wider interest as well as being better motivated mathematically. The study of parsing of grammar forms detailed in [4], the basic investigation in [8] on linear completeness amongst other results, the study of d...
متن کاملDescriptional Complexity of Context-Free Grammar Forms
Csuhaj-Vajh, E. and A. Kelemenovi, Descriptional complexity of context-free grammar forms, Theoretical Computer Science 112 (1993) 277-289. Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEI,q, LEV,<, VAR,<, PROD,< and DEP., related to any appropriate infinite class ‘8 of grammars are unbounded on the infinite class of languages d...
متن کاملDerivation Complexity in Context-Free Grammar Forms
Let F be an arbitrary context-free grammar form and (F) the family of grammars defined by F. For each grammar G in d(F), the derivation complexity function 6, on the language of G, is defined for each word x as the number of steps in a minimal G-derivation of x. It is shown that derivations may always be speeded up by any constant factor n, in the sense that for each positive integer n, an equi...
متن کاملOn the Computational Completeness of Context-Free Parallel Communicating Grammar Systems
We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are suucient to reach this g...
متن کاملContext-Free Grammar — Part I
The articles [8], [5], [9], [1], [10], [11], [3], [2], [7], [4], and [6] provide the notation and terminology for this paper. We consider tree construction structures as extensions of 1-sorted structure as systems 〈 a carrier, rules 〉, where the carrier is a set and the rules constitute a relation between the carrier and the carrier∗. Let us note that there exists a tree construction structure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90001-5